Eigen-convergence of Gaussian kernelized graph Laplacian by manifold heat interpolation

نویسندگان

چکیده

We study the spectral convergence of graph Laplacians to Laplace-Beltrami operator when kernelized affinity matrix is constructed from N random samples on a d-dimensional manifold in an ambient Euclidean space. By analyzing Dirichlet form and constructing candidate approximate eigenfunctions via convolution with heat kernel, we prove eigen-convergence rates as increases. The best eigenvalue rate N−1/(d/2+2) (when kernel bandwidth parameter ϵ∼(log⁡N/N)1/(d/2+2)) eigenvector 2-norm N−1/(d/2+3) ϵ∼(log⁡N/N)1/(d/2+3)). These hold up log⁡N-factor for finitely many low-lying eigenvalues both un-normalized normalized Laplacians. When data density non-uniform, same density-corrected Laplacian, also establish new point-wise intermediate results. Numerical results are provided support theory.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

From graph to manifold Laplacian: The convergence rate

The convergence of the discrete graph Laplacian to the continuous manifold Laplacian in the limit of sample size N → ∞ while the kernel bandwidth ε → 0, is the justification for the success of Laplacian based algorithms in machine learning, such as dimensionality reduction, semi-supervised learning and spectral clustering. In this paper we improve the convergence rate of the variance term recen...

متن کامل

Manifold parametrizations by eigenfunctions of the Laplacian and heat kernels.

We use heat kernels or eigenfunctions of the Laplacian to construct local coordinates on large classes of Euclidean domains and Riemannian manifolds (not necessarily smooth, e.g., with (alpha) metric). These coordinates are bi-Lipschitz on large neighborhoods of the domain or manifold, with constants controlling the distortion and the size of the neighborhoods that depend only on natural geomet...

متن کامل

Convergence of Multilevel Stationary Gaussian Quasi-Interpolation

In this paper we present a new multilevel quasi-interpolation algorithm for smooth periodic functions using scaled Gaussians as basis functions. Recent research in this area has focussed upon implementations using basis function with finite smoothness. In this paper we deliver a first error estimates for the multilevel algorithm using analytic basis functions. The estimate has two parts, one in...

متن کامل

Manifold Regularization for Kernelized LSTD

Policy evaluation or value function or Q-function approximation is a key procedure in reinforcement learning (RL). It is a necessary component of policy iteration and can be used for variance reduction in policy gradient methods. Therefore its quality has a significant impact on most RL algorithms. Motivated by manifold regularized learning, we propose a novel kernelized policy evaluation metho...

متن کامل

Laplacian Sum-Eccentricity Energy of a Graph

We introduce the Laplacian sum-eccentricity matrix LS_e} of a graph G, and its Laplacian sum-eccentricity energy LS_eE=sum_{i=1}^n |eta_i|, where eta_i=zeta_i-frac{2m}{n} and where zeta_1,zeta_2,ldots,zeta_n are the eigenvalues of LS_e}. Upper bounds for LS_eE are obtained. A graph is said to be twinenergetic if sum_{i=1}^n |eta_i|=sum_{i=1}^n |zeta_i|. Conditions ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied and Computational Harmonic Analysis

سال: 2022

ISSN: ['1096-603X', '1063-5203']

DOI: https://doi.org/10.1016/j.acha.2022.06.003